frequent subgraph mine outerplanar graph tam horv jan ramon stefan wrobel recent year increas interest algorithm perform frequent pattern discoveri larg databas graph structur object frequent connect subgraph mine problem tree dataset solv increment polynomi time intract arbitrari graph databas exist approach resort heurist strategi restrict search space identifi practic relev tractabl graph class tree paper defin class call tenuou outerplanar graph strict gener tree develop frequent subgraph mine algorithm tenuou outerplanar graph work increment polynomi time evalu algorithm empir nci molecular graph dataset 